The minimum distance parametrization of crystal lattices
نویسندگان
چکیده
A general parametrization for all three-dimensional crystal lattices is presented in this paper which guarantees that the three primitive vectors constructed by the parametrization are the three shortest possible, linearly independent lattice vectors existing in the whole lattice. The parameter space of this so-called minimum distance parametrization (MDP) can easily be confined to contain only lattices whose shortest distance between lattice points is not smaller than a given arbitrary length. Together with the also provided extension to general crystal structures the MDP represents a means to parametrize all (and only those) crystal structures allowed for hard core particles. PACS numbers: 02.40.Dr, 61.46.Hk, 61.50.Ah, 64.70.pv
منابع مشابه
The effect of material nonlinearity on the band gap for TE and TM modes in square and triangular lattices
In this article, by using the method of finite difference time domain (FDTD) and PML boundary conditions, we have studied the photonic band gaps for TE and TM modes in square and triangular lattices consisting of air holes in dielectric medium and compared the results. In addition, the effect of nonlinearity of the photonic crystal background on the photonic band gaps and comparison with the re...
متن کاملNotes on some Distance-Based Invariants for 2-Dimensional Square and Comb Lattices
We present explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square and comb lattices with open ends. The formulae for these indices of 2-dimensional square lattices with ends closed at themselves are also derived. The index for closed ends case divided by the same index for open ends case in the limit N →&infin defines a novel quantity we call compression...
متن کاملThe Control Parametrization Enhancing Technique for Multi-Objective Optimal Control of HIV Dynamic
In this paper, a computational approach is adopted for solving a multi-objective optimal control problem (MOOCP) formulation of optimal drug scheduling in human immunodeficiency (HIV) virus infected by individuals. The MOOCP, which uses a mathematical model of HIV infection, has some incompatible objectives. The objectives are maximizing the survival time of patients, the level of D...
متن کاملA Lattice-Theoretic Characterization of Optimal Minimum-Distance Linear Precoders
This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs.The aim is to maximize the minimum distance of the received lattice points, where the precoder is subject to an energy constraint. It is shown that the optimal precoder only produces a finite number of different lattices, namely perfect lattices, at the receiver...
متن کاملA : Lattice Algorithms and Applications Spring 2007 Lecture 3 : Minimum distance
Computing the minimum distance of a lattice (and vectors achieving the minimum distance) is a fundamental problem in the algorithmic study of lattices, and the core of many applications in computer science and cryptography. Today, we will focus on mathematical properties of lattices, and answer questions like: is the quantity λ(Λ) always achieved by a pair of vectors? (I.e., can the inf in the ...
متن کامل